Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs
نویسندگان
چکیده
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that they enable nonmonotonic reasoning, a desirable feature in locally closed subareas of the Semantic Web.
منابع مشابه
Extending Conceptual Logic Programs with Arbitrary Rules
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules. Furthermore, ECLPs are more expressive in the sense that...
متن کاملOpen answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guarding knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reaso...
متن کاملNonmonotonic Inheritance, Argumentation and Logic Programming
We study the conceptual relationship between the semantics of nonmonotonic inheritance reasoning and argumentation. We show that the credulous semantics of nonmonotonic inheritance network can be captured by the stable semantics of argumentation. We present a transformation of nonmonotonic inheritance networks into equivalent extended logic programs.
متن کاملNonmonotonic Existential Rules for Non-Tree-Shaped Ontological Modelling
Description logic (DL) formalisms are extensively used for ontological modelling, e.g., in biology [16] and chemistry [19]. One such example is the ChEBI ontology [20] – a reference terminology adopted by various biological databases for chemical annotation [23,8,10]. Despite their wide range of expressive features, DLs are severely limited in their ability to represent structures that are not ...
متن کاملSolving Practical Reasoning Poblems with Extended Disjunctive Logic Programming
We present a de nition of stable generated models for extended generalized logic programs (EGLP) which a) subsumes the de nition of the answer set semantics for extended normal logic programs [GL91]; and b) does not refer to negation-as-failure by allowing for arbitrary quanti er free formulas in the body and in the head of as rule (i.e. does not depend on the presence of any speci c connective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005